Hamiltonian Decomposition of Recursive
نویسنده
چکیده
We show that recursive circulant G(cd m ; d) is hamiltonian decomposable. Recursive circulant is a graph proposed for an interconnection structure of multicomputer networks in [8]. The result is not only a partial answer to the problem posed by Alspach that every connected Cayley graph over an abelian group is hamiltonian decomposable, but also an extension of Micheneau's that recursive circulant G(2 m ; 4) is hamiltonian decomposable.
منابع مشابه
Numerical solution of fuzzy Hunter-Saxton equation by using Adomian decomposition and Homotopy analysis methods
In this paper, a fuzzy Hunter-Saxton equation is solved by using the Adomian'sdecomposition method (ADM) and homotopy analysis method (HAM). Theapproximation solution of this equation is calculated in the form of series whichits components are computed by applying a recursive relation. The existenceand uniqueness of the solution and the convergence of the proposed methodsare proved. A numerical...
متن کاملA Comparison Between Fourier Transform Adomian Decomposition Method and Homotopy Perturbation ethod for Linear and Non-Linear Newell-Whitehead-Segel Equations
In this paper, a comparison among the hybrid of Fourier Transform and AdomianDecomposition Method (FTADM) and Homotopy Perturbation Method (HPM) is investigated.The linear and non-linear Newell-Whitehead-Segel (NWS) equations are solved and the results arecompared with the exact solution. The comparison reveals that for the same number of componentsof recursive sequences, the error of FTADM is ...
متن کاملHamiltonian decomposition of recursive circulant graphs
The graph G(N; d) has vertex set V = {0; 1; : : : ; N − 1}, with {v; w} an edge if v − w ≡ ±di(modN ) for some 06i6dlogd Ne − 1. We show that the circulant graph G(cd; d) is Hamilton decomposable for all positive integers c; d, and m with c¡d. This extends work of Micheneau and answers a special case of a question of Alspach. c © 2000 Elsevier Science B.V. All rights reserved.
متن کاملNUMERICAL SOLUTION OF BOUSSINESQ EQUATION USING MODIFIED ADOMIAN DECOMPOSITION AND HOMOTOPY ANALYSIS METHODS
In this paper, a Boussinesq equation is solved by using the Adomian's decomposition method, modified Adomian's decomposition method and homotopy analysis method. The approximate solution of this equation is calculated in the form of series which its components are computed by applying a recursive relation. The existence and uniqueness of the solution and the convergence of the proposed methods ...
متن کاملHIERARCHICAL COMPUTATION OF HERMITE SPHERICAL INTERPOLANT
In this paper, we propose to extend the hierarchical bivariateHermite Interpolant to the spherical case. Let $T$ be an arbitraryspherical triangle of the unit sphere $S$ and let $u$ be a functiondefined over the triangle $T$. For $kin mathbb{N}$, we consider aHermite spherical Interpolant problem $H_k$ defined by some datascheme $mathcal{D}_k(u)$ and which admits a unique solution $p_k$in the ...
متن کامل